On Multidimensional Packing Problems
نویسندگان
چکیده
منابع مشابه
Heuristics for Multidimensional Packing Problems
In this thesis we consider solution methods for packing problems. Packing problems occur in manydifferent situations both directly in the industry and as sub-problems of other problems. High-qualitysolutions for problems in the industrial sector may be able to reduce transportation and productioncosts significantly. For packing problems in general are given a set of items and one of...
متن کاملOptimal Online Algorithms for Multidimensional Packing Problems
We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...
متن کاملOn Variable-Sized Multidimensional Packing
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimensional bins of various sizes, and the goal is to minimize the total volume of the used bins. We show that the method used can also be extended to deal with the problem of resource augmented multidimensional packing, whe...
متن کاملFast Approximate PCPs for Multidimensional Bin-Packing Problems
We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blocks can be packed into a small number of bins. The running time of the verifier is bounded by , where is the time required to test for heaviness. We give heaviness testers that can test heaviness of an element in the domain in t...
متن کاملMultidimensional Bin Packing and Other Related Problems: A Survey
The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely important in practice and finds numerous applications in scheduling, routing and resource alloca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2004
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539799356265